Sycon: a new milestone in designing ASCON-like permutations
نویسندگان
چکیده
ASCON is one of the elegant designs authenticated encryption with associated data (AEAD) that was selected as first choice for lightweight applications in CAESAR competition, which also has been submitted to NIST cryptography standardization. literature a while; however, there no successful AEAD secure and at same time lighter than ASCON. In this article, we have overcome challenge constructing permutation while ensuring similar performance, based on achieve more call Sycon. Extensive security analysis Sycon confirms it provides level Our hardware implementation result shows 5.35% reduced area, compared permutation. This leads remarkable area reduction about 14.95% AEAD. We regard new milestone lightest among all AEADs belonging family.
منابع مشابه
Generalized Distinguishing Attack: A New Cryptanalysis of AES-like Permutations
We consider highly structured truncated differential paths to mount rebound attacks on hash functions based on AES-like permutations. We explain how such differential paths can be computed using a Mixed-Integer Linear Programming approach. Together with the SuperSBox description, this allows us to build a rebound attack with a 6-round inbound phase whereas classical rebound attacks have 4-round...
متن کاملdesigning a fast locking pll
a phase-locked loop (pll) based frequency synthesizer is an important circuit that is used in many applications, especially in communication systems such as ethernet receivers, disk drive read/write channels, digital mobile receivers, high-speed memory interfaces, system clock recovery and wireless communication system. other than requiring good signal purity such as low phase noise and low spu...
Cryptanalysis of Ascon
We present a detailed security analysis of the CAESAR candidate Ascon. Amongst others, cube-like, differential and linear cryptanalysis are used to evaluate the security of Ascon. Our results are practical key-recovery attacks on round-reduced versions of Ascon-128, where the initialization is reduced to 5 out of 12 rounds. Theoretical keyrecovery attacks are possible for up to 6 rounds of init...
متن کاملForest-like permutations
Given a permutation π ∈ Sn, construct a graph Gπ on the vertex set {1, 2, . . . , n} by joining i to j if (i) i < j and π(i) < π(j) and (ii) there is no k such that i < k < j and π(i) < π(k) < π(j). We say that π is forest-like if Gπ is a forest. We first characterize forest-like permutations in terms of pattern avoidance, and then by a certain linear map being onto. Thanks to recent results of...
متن کاملLaparoscopic Cholecystectomy: A New Milestone or a Dangerous Innovation?
Minimal access surgery via the operating laparoscope has been performed by our gynaecological colleagues for many years. General surgeons have been slow to develop expertise in the techniques of laparoscopic surgery. The new small television cameras and the excellent colour television reproduction, together with purpose designed instrumentation, have made safe laparoscopic surgery a reality rat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptographic Engineering
سال: 2021
ISSN: ['2190-8508', '2190-8516']
DOI: https://doi.org/10.1007/s13389-021-00272-9